Polar codes for q-ary channels, q=2r

نویسندگان

  • Woomyoung Park
  • Alexander Barg
چکیده

We study polarization for nonbinary channels with input alphabet of size q = 2 , r = 2, 3, . . . . Using Arıkan’s polarizing kernel H2, we prove that the virtual channels that arise in the process of polarization converge to q-ary channels with capacity 1, 2, . . . , r bits, and that the total transmission rate approaches the symmetric capacity of the channel. This leads to an explicit transmission scheme for q-ary channels. The error probability of decoding using successive cancellation behaves as exp(−N), where N is the code length and α is any constant less than 0.5.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Direct Polarization for q-ary Source and Channel Coding

It has been shown that an extension of the basic binary polar transformation also polarizes over finite fields. With it the direct encoding of q-ary sources and channels is a process that can be implemented with simple and efficient algorithms. However, direct polar decoding of q-ary sources and channels is more involved. In this paper we obtain a recursive equation for the likelihood ratio exp...

متن کامل

An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets

We prove a lower estimate on the increase in entropy when two copies of a conditional random variable X|Y , with X supported on Zq = {0, 1, . . . , q − 1} for prime q, are summed modulo q. Specifically, given two i.i.d. copies (X1, Y1) and (X2, Y2) of a pair of random variables (X,Y ), with X taking values in Zq, we show H(X1 +X2 | Y1, Y2)−H(X|Y ) ≥ α(q) ·H(X|Y )(1−H(X|Y )) for some α(q) > 0, w...

متن کامل

Polar martingales of maximal spread

This paper investigates polar codes for q-ary input channels using other kernels than [ 1 0 1 1 ] to construct the generator matrix. The kernel is optimized by maximizing the spread of the polar martingale and it is shown that in certain cases, the resulting construction has a significantly improved error probability (even at small block length like n = 1024).

متن کامل

Non-binary multithreshold decoders of symbolic self- orthogonal codes for q-ary symmetric channels

Symbolic q-ary multithreshold decoding (qMTD) of q-ary self-orthogonal codes is submitted. It’s shown the BER performance of qMTD is close to the results provided by optimum total search methods, which are not realizable for nonbinary codes in general. New decoders are compared with different decoders of Reed-Solomon codes. The performance provided by non-binary MTD in some cases is unattainabl...

متن کامل

A Fresh Look at Coding for q-ary Symmetric Channels

This paper studies coding schemes for the q-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size q = 2, m ∈ N, thus complementing some recently proposed packet-based schemes requiring large q. First, theoretical optimality of a simple layered scheme is shown, then a practical coding scheme based on a simple modification of standard binary L...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2012